Quasigroups in cryptology
نویسنده
چکیده
We give a review of some known published applications of quasigroups in cryptology.
منابع مشابه
On Some Known Possible Applications of Quasigroups in Cryptology
It is surveyed known (published) possible application of binary and n-ary quasigroups in cryptology. Mathematics Subject Classification: 20N05, 94A60.
متن کاملOn Middle Universal m-Inverse Quasigroups and Their Applications to Cryptography
This study presents a special type of middle isotopism under which m-inverse quasi-groups are isotopic invariant. A sufficient condition for an m-inverse quasigroup that is specially isotopic to a quasigroup to be isomorphic to the quasigroup isotope is established. It is shown that under this special type of middle isotopism, if n is a positive even integer, then, a quasigroup is an m-inverse ...
متن کاملA Quasigroup Based Random Number Generator for Resource Constrained Environments
This paper proposes a pseudo random number generator (PRNG) based on quasigroups. The proposed PRNG has low memory requirements, is autonomous and the quality of the output stream of random numbers is better than other available standard PRNG implementations (commercial and open source) in majority of the tests. Comparisons are done using the benchmark NIST Statistical Test Suite and compressio...
متن کاملMultipermutations in Crypto World: Different Faces of the Perfect Diffusion Layer
Diffusion layers, and specially perfect diffusion layers, are very important subject for cryptographic research. Main quest is a perfect diffusion layer with more optimal hardware and/or software implementations (if possible, the last needs to holds also for its inverse). Different structures can be used for representing these layers, but all are interconnected. We start with multipermutations ...
متن کاملSBIM(Q) - a Multivariate Polynomial Trapdoor Function over the Field of Rational Numbers
In this paper we define a trapdoor function called SBIM(Q) by using multivariate polynomials over the field of rational numbers Q. The public key consists of 2n multivariate polynomials with 3n variables y1, . . . , yn, z1, . . . , z2n. The yi variables take care for the information content, while the zi variables are for redundant information. Thus, for encryption of a plaintext of n rational ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 17 شماره
صفحات -
تاریخ انتشار 2009